
def QuickSort(nums:list):
    if len(nums)<2:
        return 0
    else:
        left=0
        right=len(nums)-1
        pivot = nums[left]
        while i!=j:
            if nums[i]<=pivot:

        # 4 5 1 8 7 2 6
        baseValue=num[0]
        baseValueIndex=0
        leftIndex=0
        Newnum=[]
        for i in range(len(num)):
            if num[i] <= baseValue:
                Newnum.append(num[i])
            else:
                leftIndex=leftIndex+1
                Newnum[leftIndex+baseValueIndex]=num[i]

if __name__=='__main__':
